Seeing Shapes in Clouds: On the Performance-Cost trade-off for Heterogeneous Infrastructure-as-a-Service

نویسندگان

  • Gordon Inggs
  • David B. Thomas
  • George A. Constantinides
  • Wayne Luk
چکیده

In the near future FPGAs will be available by the hour, however this new Infrastructure as a Service (IaaS) usage mode presents both an opportunity and a challenge: The opportunity is that programmers can potentially trade resources for performance on a much larger scale, for much shorter periods of time than before. The challenge is in finding and traversing the trade-off for heterogeneous IaaS that guarantees increased resources result in the greatest possible increased performance. Such a trade-off is Pareto optimal. The Pareto optimal trade-off for clusters of heterogeneous resources can be found by solving multiple, multi-objective optimisation problems, resulting in an optimal allocation of tasks to the available platforms. Solving these optimisation programs can be done using simple heuristic approaches or formal Mixed Integer Linear Programming (MILP) techniques. When pricing 128 financial options using a Monte Carlo algorithm upon a heterogeneous cluster of Multicore CPU, GPU and FPGA platforms, the MILP approach produces a trade-off that is up to 110% faster than a heuristic approach, and over 50% cheaper. These results suggest that high quality performance-resource trade-offs of heterogeneous IaaS are best realised through a formal optimisation approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A service decomposition and definition model in cloud manufacturing systems using game theory focusing on cost accounting perspectives

Cloud manufacturing is a new paradigm which has been under study since 2010 and a vast body of research has been conducted on this topic. Among them, service composition problems are of utmost importance. However, most studies only focused on private clouds meaning the objective function is defined for just one component of the supply chain. This paper attempts to consider service composition p...

متن کامل

Policy Choices for Progressive Realization of Universal Health Coverage; Comment on “Ethical Perspective: Five Unacceptable Trade-offs on the Path to Universal Health Coverage”

In responses to Norheim’s editorial, this commentary offers reflections from Thailand, how the five unacceptable trade-offs were applied to the universal health coverage (UHC) reforms between 1975 and 2002 when the whole 64 million people were covered by one of the three public health insurance systems. This commentary aims to generate global discussions on how best UHC can be gradually achieve...

متن کامل

A Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm

In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...

متن کامل

A Hybrid Method Based on Fuzzy AHP and VIKOR for the Discrete Time-Cost-Quality Trade-off Problem

Time, cost and quality are considered as the main components in managing each project. Previous researches have mainly focused on the time-cost trade-off problems. Recently quality is considered as the most important factor in project�s success, which is influenced by time acceleration that is the less time is spent the more success is gained. In time-cost-quality trade-off problems, each act...

متن کامل

A multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project

This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1506.06684  شماره 

صفحات  -

تاریخ انتشار 2015